Hamiltonicity of edge chromatic critical graphs

Vizing conjectured that every edge chromatic critical graph contains a 2-factor. Believing that stronger properties hold for this class of graphs, Luo and Zhao (2013) showed that every edge chromatic critical graph of order $n$ with maximum degree at least $\frac{6n}{7}$ is Hamiltonian. Furthermore, Luo et al. (2016) proved that every edge chromatic critical graph of order $n$ with maximum degree at least $\frac{4n}{5}$ is Hamiltonian. In this paper, we prove that every edge chromatic critical graph of order $n$ with maximum degree at least $\frac{3n}{4}$ is Hamiltonian. Our approach is inspired by the recent development of Kierstead path and Tashkinov tree techniques for multigraphs.     

Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree

For graphs G and H , an H‐coloring of G is a map from the vertices of G to the vertices of H that preserves edge adjacency. We consider the following extremal enumerative question: for a given H , which connected n‐vertex graph with minimum degree δ maximizes the number of H‐colorings? We show that for nonregular H and sufficiently large n , the complete bipartite graph is the unique maximizer. As a corollary, for nonregular H and sufficiently large n the graph is the unique k‐connected graph that maximizes the number of H‐colorings among all k‐connected graphs. Finally, we show that this conclusion does not hold for all regular H by exhibiting a connected n‐vertex graph with minimum degree δ that has more ‐colorings (for sufficiently large q and n ) than .     

Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

Consider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v. Let us then consider a stronger requirement and suppose we wish to distinguishing adjacent vertices by sums of their incident colors. In both problems the challenging conjectures presume that such colorings exist for any graph G containing no isolated edges if only . We prove that in both problems is sufficient. The proof is based on the Combinatorial Nullstellensatz, applied in the “sum environment.” In fact the identical bound also holds if we use any set of k real numbers instead of as edge colors, and the same is true in list versions of the both concepts. In particular, we therefore obtain that lists of length ( in fact) are sufficient for planar graphs.     

Large Cross‐Free Sets in Steiner Triple Systems

A cross‐free set of size m in a Steiner triple system is three pairwise disjoint m‐element subsets such that no intersects all the three ‐s. We conjecture that for every admissible n there is an STS(n) with a cross‐free set of size which if true, is best possible. We prove this conjecture for the case , constructing an STS containing a cross‐free set of size 6k. We note that some of the 3‐bichromatic STSs, constructed by Colbourn, Dinitz, and Rosa, have cross‐free sets of size close to 6k (but cannot have size exactly 6k). The constructed STS shows that equality is possible for in the following result: in every 3‐coloring of the blocks of any Steiner triple system STS(n) there is a monochromatic connected component of size at least (we conjecture that equality holds for every admissible n). The analog problem can be asked for r‐colorings as well, if and is a prime power, we show that the answer is the same as in case of complete graphs: in every r‐coloring of the blocks of any STS(n), there is a monochromatic connected component with at least points, and this is sharp for infinitely many n.     

An infinite family of subcubic graphs with unbounded packing chromatic number

Recently, Balogh et al. (2018) answered in negative the question that was posed in several earlier papers whether the packing chromatic number is bounded in the class of graphs with maximum degree 3. In this note, we present an explicit infinite family of subcubic graphs with unbounded packing chromatic number.     

On DP-coloring of digraphs

DP-coloring is a relatively new coloring concept by Dvořák and Postle and was introduced as an extension of list-colorings of (undirected) graphs. It transforms the problem of finding a list-coloring of a given graph $G$ with a list-assignment $L$ to finding an independent transversal in an auxiliary graph with vertex set $\text{◂{}▸}\{\left(v,c\right)|\text{◂+▸}v\in V\left(G\right),\text{◂+▸}c\in L\left(v\right)\}$. In this paper, we extend the definition of DP-colorings to digraphs using the approach from Neumann-Lara where a coloring of a digraph is a coloring of the vertices such that the digraph does not contain any monochromatic directed cycle. Furthermore, we prove a Brooks’ type theorem regarding the DP-chromatic number, which extends various results on the (list-)chromatic number of digraphs.     

List coloring triangle-free planar graphs

This paper proves the following result. Assume $G$ is a triangle-free planar graph, $X$ is an independent set of $G$. If $L$ is a list assignment of $G$ such that $\text{◂=▸}|L\left(v\right)|=4$ for each vertex $\text{◂+▸}v\in V\left(G\right)-X$ and $\text{◂=▸}|L\left(v\right)|=3$ for each vertex $v\in X$, then $G$ is $L$-colorable.     

On coloring numbers of graph powers

The weak $r$-coloring numbers ${\mathrm{wcol}}_r\left(G\right)$ of a graph $G$ were introduced by the first two authors as a generalization of the usual coloring number $\mathrm{col}\left(G\right)$, and have since found interesting theoretical and algorithmic applications. This has motivated researchers to establish strong bounds on these parameters for various classes of graphs.Let $G^p$ denote the $p$th power of $G$. We show that, all integers $p>0$ and $\Delta \ge 3$ and graphs $G$ with $\Delta \left(G\right)\le \Delta$ satisfy $\mathrm{col}\left(G^p\right)\in O\left(p\cdot {\mathrm{wcol}}_{\lceil p∕2\rceil }\left(G\right){(\Delta -1)}^{\lfloor p∕2\rfloor }\right)$; for fixed tree width or fixed genus the ratio between this upper bound and worst case lower bounds is polynomial in $p$. For the square of graphs $G$, we also show that, if the maximum average degree $2k-2<\mathrm{mad}\left(G\right)\le 2k$, then $\mathrm{col}\left(G^2\right)\le (2k-1)\Delta \left(G\right)+2k+1$.     

Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic

Let G be a graph which can be embedded in a surface of nonnegative Euler characteristic.In this paper,it is proved that the total chromatic number of G is △(G)+1 if △(G)9,where △(G)is the maximum degree of G.